Causal structures from entropic information: geometry and novel scenarios
نویسندگان
چکیده
Bellʼs theorem in physics, as well as causal discovery in machine learning, both face the problem of deciding whether observed data is compatible with a presumed causal relationship between the variables (for example, a local hidden variable model). Traditionally, Bell inequalities have been used to describe the restrictions imposed by causal structures on marginal distributions. However, some structures give rise to non-convex constraints on the accessible data, and it has recently been noted that linear inequalities on the observable entropies capture these situations more naturally. In this paper, we show the versatility of the entropic approach by greatly expanding the set of scenarios for which entropic constraints are known. For the first time, we treat Bell scenarios involving multiple parties and multiple observables per party. Going beyond the usual Bell setup, we exhibit inequalities for scenarios with extra conditional independence assumptions, as well as a limited amount of shared randomness between the parties. Many of our results are based on a geometric observation: Bell polytopes for two-outcome measurements can be naturally imbedded into the convex cone of attainable marginal entropies. Thus, any entropic inequality can be translated into one valid for probabilities. In some situations the converse also holds, which provides us with a rich source of candidate entropic inequalities.
منابع مشابه
SIZE AND GEOMETRY OPTIMIZATION OF TRUSSES USING TEACHING-LEARNING-BASED OPTIMIZATION
A novel optimization algorithm named teaching-learning-based optimization (TLBO) algorithm and its implementation procedure were presented in this paper. TLBO is a meta-heuristic method, which simulates the phenomenon in classes. TLBO has two phases: teacher phase and learner phase. Students learn from teachers in teacher phases and obtain knowledge by mutual learning in learner phase. The suit...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملTHE EUROPEAN PHYSICAL JOURNAL PLUS Characterization of the complexity of an ED model via information geometry
Characterization of the complexity of an entropic dynamical model is investigated from the viewpoint of information geometry. By introducing a Riemannian metric with respect to the underlying statistical manifold, the geometric structure is achieved. Based on the general construction, the instability of the geodesic spreads on this manifold is analyzed via the associated Jacobi vector field. En...
متن کاملA Discrete Singular Convolution Method for the Seepage Analysis in Porous Media with Irregular Geometry
A novel discrete singular convolution (DSC) formulation is presented for the seepage analysis in irregular geometric porous media. The DSC is a new promising numerical approach which has been recently applied to solve several engineering problems. For a medium with regular geometry, realizing of the DSC for the seepage analysis is straight forward. But DSC implementation for a medium with ir...
متن کاملConnecting Causal Events: Learning Causal Structures Through Repeated Interventions Over Time
How do we learn causal structures? All current approaches use scenarios in which trials are temporally independent; however, people often learn about scenarios unfolding over time. In such cases, people may assume that other variables don’t change at the same instant as an intervention. In Experiment 1, participants were much more successful at learning causal structures when this assumption wa...
متن کامل